Sparse representation learning with modified q-VAE towards minimal realization of world model

نویسندگان

چکیده

Extraction of low-dimensional latent space from high-dimensional observation data is essential to construct a real-time robot controller with world model on the extracted space. However, there no established method for tuning dimension size automatically, suffering finding necessary and sufficient size, i.e. minimal realization model. In this study, we analyze improve Tsallis-based variational autoencoder (q-VAE), reveal that, under an appropriate configuration, it always facilitates making sparse. Even if pre-specified redundant compared realization, sparsification collapses unnecessary dimensions, allowing easy removal them. We experimentally verified benefits by proposed that can easily find six dimensions reaching task mobile manipulator requires six-dimensional state Moreover, planning such minimal-realization learned in was able exert more optimal action sequence real-time, reducing accomplishment time around 20%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Building topographic subspace model with transfer learning for sparse representation

In this paper, we propose a topographic subspace learning algorithm, named key-coding learning, which utilizes irrelevant unlabeled auxiliary data to facilitate image classification and retrieval tasks. It is worth noticing that we do not need to assume the auxiliary data follows the same class labels or generative distribution as the target training data. Firstly, the subspace model is learnt ...

متن کامل

Sparse Q-learning with Mirror Descent

This paper explores a new framework for reinforcement learning based on online convex optimization, in particular mirror descent and related algorithms. Mirror descent can be viewed as an enhanced gradient method, particularly suited to minimization of convex functions in highdimensional spaces. Unlike traditional gradient methods, mirror descent undertakes gradient updates of weights in both t...

متن کامل

Deblocking Joint Photographic Experts Group Compressed Images via Self-learning Sparse Representation

JPEG is one of the most widely used image compression method, but it causes annoying blocking artifacts at low bit-rates. Sparse representation is an efficient technique which can solve many inverse problems in image processing applications such as denoising and deblocking. In this paper, a post-processing method is proposed for reducing JPEG blocking effects via sparse representation. In this ...

متن کامل

Sparse Tabular Multiagent Q-learning

Multiagent learning problems can in principle be solved by treating the joint actions of the agents as single actions and applying singleagent Q-learning. However, the number of joint actions is exponential in the number of agents, rendering this approach infeasible for most problems. In this paper we investigate a sparse representation of the Q-function by only considering the joint actions in...

متن کامل

Towards Minimal Periodical Representation of Calendar Expressions

This paper reports recent results on deriving mathematical (periodical) representations of time granularities from more user friendly algebraic expressions. The practical application of these results can be found in using systems for solving multi-granularity temporal constraint satisfaction problems. Indeed, while these systems in principle allow users to specify distance constraints in terms ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advanced Robotics

سال: 2023

ISSN: ['1568-5535', '0169-1864']

DOI: https://doi.org/10.1080/01691864.2023.2221715